Area-time tradeoffs for universal VLSI circuits

نویسندگان

  • Sandeep N. Bhatt
  • Gianfranco Bilardi
  • Geppino Pucci
چکیده

An area-universal VLSI circuit can be programmed to emulate every circuit of a given area, but at the cost of lower area-time performance. In particular, if a circuit with area-time bounds (A, T ) is emulated by a universal circuit with bounds (Au, Tu), we say that the universal circuit has blowup Au/A and slowdown Tu/T . A central question in VLSI theory is to investigate the inherent costs and tradeoffs of universal circuit designs. Prior to this work, universal designs were known for area-A circuits with O(1) blowup and O(log A) slowdown. Universal designs for the family of area-A circuits containing O( √ A1+ log A) vertices, with O(A ) blowup and O(log log A) slowdown had also been developed. However, the existence of universal circuits with O(1) slowdown and relatively small blowup was an open question. In this paper, we settle this question by designing an area-universal circuit U A with O (1/ ) slowdown and O (A ) blowup, for any value of the parameter , with 4 log log A/ log A ≤ ≤ 1. By varying , we obtain universal circuits which operate at different points in the spectrum of the slowdown-blowup tradeoff. In particular, when is chosen to be a constant, our universal circuit yields O(1) slowdown. © 2008 Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Area-Universal Circuits with Constant Slowdown

An area-universal VLSI circuit can be programmed to emulate every circuit of a given area, but at the cost of lower area-time performance. In particular, if a circuit with area-time bounds (A; T ) is emulated with a universal circuit with bounds (Au; Tu); we say that the universal circuit has blowup Au=A and slowdown Tu=T . A central question in VLSI theory is to investigate the inherent costs ...

متن کامل

Spice Compatible Model for Multiple Coupled Nonuniform Transmission Lines Application in Transient Analysis of VLSI Circuits

An SPICE compatible model for multiple coupled nonuniform lossless transmission lines (TL's) is presented. The method of the modeling is based on the steplines approximation of the nonuniform TLs and quasi-TEM assumptions. Using steplines approximation the system of coupled nonuniform TLs is subdivided into arbitrary large number of coupled uniform lines (steplines) with different characteristi...

متن کامل

Area–Time Performances of Some Neural Computations

The paper aims to show that VLSI efficient implementations of Boolean functions (BFs) using threshold gates (TGs) are possible. First we detail depth-size tradeoffs for COMPARISON when implemented by TGs of variable fan-in (∆); a class of polynomially bounded TG circuits having O (lgn ⁄ lg∆) depth and O (n ⁄ ∆) size for any 3 ≤ ∆ ≤ clgn, improves on the previous known size O (n). We then procee...

متن کامل

Low-Energy Logic Circuit Techniques for Multiple-Valued Logic

Multiple valued logic (MVL) has been proposed as a means for reducing the power, improving the speed, and increasing the packing density of VLSI circuits. These performance improvements are achieved by designers who identify signal processing functions that can benefit from the design tradeoffs possible with MVL. Since advocates of MVL are accustomed to incorporating the possible tradeoffs of M...

متن کامل

Effects of Analog-VLSI Hardware on the Performance of the LMS Algorithm

Device mismatch, charge leakage and nonlinear transfer functions limit the resolution of analog-VLSI arithmetic circuits and degrade the performance of neural networks and adaptive filters built with this technology. We present an analysis of the impact of these issues on the convergence time and residual error of a linear perceptron using the Least-Mean-Square (LMS) algorithm. We also identify...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 408  شماره 

صفحات  -

تاریخ انتشار 2008